In this paper, we present a detailed study of Minimum ReconfigurationProbability Routing (MRPR) algorithm, and its performance evaluation incomparison with Adaptive unconstrained routing (AUR) and Least Loaded routing(LLR) algorithms. We have minimized the effects of failures on link and routerfailure in the network under changing load conditions, we assess theprobability of service and number of light path failures due to link or routefailure on Wavelength Interchange(WI) network. The computation complexity isreduced by using Kalman Filter(KF) techniques. The minimum reconfigurationprobability routing (MRPR) algorithm selects most reliable routes and assignwavelengths to connections in a manner that utilizes the light path(LP)established efficiently considering all possible requests.
展开▼
